Effective Broadcast Scheduling In Wireless Sensor Network By Optimization Of Latency

Broadcasting plays an important role in the communication protocol design and it acts as a fundamental operation in wireless sensor network (WSN). This paper investigates the Minimum Latency Broadcast Scheduling Duty Cycled (MLBSDC) problem in WSN performing scheduling with minimum collision. The MLBSDC problem aims to find a broadcast scheduling that minimizes the time in which the last node receives a broadcast message with minimum collision. The focus is mainly on providing minimum collision and finding the lower bound of broadcast latency. In this paper, a novel algorithm Effective Broadcast Scheduling with Optimized Latency (EBSOL) is proposed. EBSOL allow nodes in different layers of the broadcast tree to transmit the message simultaneously. It is proved that EBSOL produces a latency of at most 12 |T|, where T denotes the number of time slots in a scheduling period. In EBSOL algorithm, latency and the collision is reduced by layered approach. To prevent collision, each node delays its transmission to the next working (active time) period. The results from extensive simulation show that EBSOL has a better performance than the existing One To All Broadcast (OTAB) algorithm in terms of reduction in latency, number of transmission and collision.